AND/OR search spaces for graphical models

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AND/OR search spaces for graphical models

The paper introduces an AND/OR search space perspective for graphical models that include probabilistic networks (directed or undirected) and constraint networks. In contrast to the traditional (OR) search space view, the AND/OR search tree displays some of the independencies present in the graphical model explicitly and may sometimes reduce the search space exponentially. Indeed, most algorith...

متن کامل

Weighted Best First Search for Graphical Models

The paper considers Weighted Best First (WBF) search schemes, popular for path-finding domain, as approximations and as anytime schemes for the MAP task. We demonstrate empirically the ability of these schemes to effectively provide approximations with guaranteed suboptimality and also show that as anytime schemes they can be competitive on some benchmarks with one of the best state-of-the-art ...

متن کامل

Importance sampling-based estimation over AND/OR search spaces for graphical models

The paper introduces a family of approximate schemes that extend the process of computing sample mean in importance sampling from the conventional OR space to the AND/OR search space for graphical models. All the sample means are defined on the same set of samples and trade time with variance. At one end is the AND/OR sample tree mean which has the same time complexity as the conventional OR sa...

متن کامل

Search Algorithms for m Best Solutions for Graphical Models

The paper focuses on finding the m best solutions to combinatorial optimization problems using Best-First or Branchand-Bound search. Specifically, we present m-A*, extending the well-known A* to the m-best task, and prove that all its desirable properties, including soundness, completeness and optimal efficiency, are maintained. Since Best-First algorithms have memory problems, we also extend t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 2007

ISSN: 0004-3702

DOI: 10.1016/j.artint.2006.11.003